On the proximal point algorithm and demimetric mappings in CAT(0) spaces
نویسندگان
چکیده
منابع مشابه
W-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملOn the fixed point theorems in generalized weakly contractive mappings on partial metric spaces
In this paper, we prove a fixed point theorem for a pair of generalized weakly contractive mappings in complete partial metric spaces. The theorems presented are generalizations of very recent fixed point theorems due to Abdeljawad, Karapinar and Tas. To emphasize the very general nature of these results, we illustrate an example.
متن کاملRegularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in Banach spaces
* Correspondence: [email protected] Department of Mathematics Education, Kyungnam University, Masan, Kyungnam, 631-701, Korea Full list of author information is available at the end of the article Abstract We study the strong convergence of a regularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in a uniformly convex and unifo...
متن کاملWorking Paper Proximal Point Mappings and Constraint Aggregation Principle Proximal Point Mappings and Constraint Aggregation Principle Proximal Point Mappings and Constraint Aggregation Principle
In the present paper we study a regularization techniques for the constraint aggregation method for solving large scale convex optimization problems. Idea of the constraint aggregation is in replacing the set of original constraints by a single one which is a certain linear combination of them. This makes the resulting relaxed problemmuch easier to solve. However, previous algorithms that used ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Demonstratio Mathematica
سال: 2018
ISSN: 2391-4661
DOI: 10.1515/dema-2018-0022